Partitioning trees: A global multiclass classification technique for SVMs
نویسندگان
چکیده
منابع مشابه
Gene Expression Classification: Decision Trees vs. SVMs
In this article, we compare decision trees (DT) and support vector machines (SVM) in classifying gene expressions. With the explosion of genome research, tremendous amount of data have been made available and a deep insight study becomes demanding. Among various kinds of gene analysis approaches being developed, sequence based gene expression classification shows the importance due to its abili...
متن کاملMulticlass SVMs for Olfactory Classi cation
The study of olfactory classi cation has many attractions, philosophical and theoretical as well as practical and functional. As part of the study of human cognition, it is widely recognized that the olfactory sense is a fundamental component of the human perceptual system. The human brain is believed to have evolved around the olfactory sense, and consequently the algorithms evolved for olfact...
متن کاملFuzzy LP-SVMs for Multiclass Problems
In this paper, we propose fuzzy linear programming support vector machines (LP-SVMs) that resolve unclassifiable regions for multiclass problems. Namely, in the directions orthogonal to the decision functions obtained by training the LP-SVM, we define membership functions. Then by the minimum or average operation for these membership functions we define a membership function for each class. We ...
متن کاملOptimal Partitioning for Classification and Regression Trees
In designing a decision tree for classification or regression, one selects at each node a feature to be tested, and partitions the range of that feature into a small number of bins, each bin corresponding to a child of the node. When the feature’s range is discrete with N unordered outcomes, the optimal partition, that is, the partition minimizing an expected loss, is usually found by an exhaus...
متن کاملAD-SVMs: A light extension of SVMs for multicategory classification
The margin maximization principle implemented by binary Support Vector Machines (SVMs) has been shown to be equivalent to find the hyperplane equidistant to the closest points belonging to the convex hulls that enclose each class of examples. In this paper, we propose an extension of SVMs for multicategory classification which generalizes this geometric formulation. The obtained method preserve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence Research
سال: 2014
ISSN: 1927-6982,1927-6974
DOI: 10.5430/air.v3n2p41